1-transitive Cyclic Orderings

نویسندگان

  • G. Campero-Arena
  • J. K. Truss
چکیده

We give a classification of all the countable 1-transitive cyclic orderings, being those on which the automorphism group acts singly transitively. We also classify all the countable 1-transitive coloured cyclic orderings, where these are countable cyclic orderings in which each point is assigned a member of a set C, thought of as its ‘colour’, and by ‘1transitivity’ we now mean that the automorphism group acts singly transitively on each set of points coloured by a fixed colour. We conclude by giving constructions of some uncountable cyclic orderings whose automorphism groups enjoy certain special properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transitive orderings of properties of utility functions

This note considers orderings of properties (or assumptions) on utility functions and specifies domains on which those orderings are transitive or acyclic.

متن کامل

Arrow's Theorem for incomplete relations

Let U be a set with three or more elements, let W be the set of weak orderings of U, let T be the set of total orderings of U, and let f be an n-ary function mapping Wn to W. Arrow’s Impossibility Theorem asserts that if f satisfies Arrow’s Condition P (“Pareto”) and Condition 3 (“independence of irrelevant alternatives”) then f is a projection function on total orderings, i. e., there is some ...

متن کامل

Linear ordering preferences in Japanese: Implications for current production models

The current research investigates the claim that sort-before-long (SL) constituent orderings are easier to produce than long-beforeshort (LS) orderings (e.g., Stallings et al., 1998). 12 Japanese native speakers repeated LS and SL ordered simple transitive and double object sentences. In a control condition, participants repeated sentences directly, and in another participants performed a memor...

متن کامل

Subdivisions of Transitive Tournaments

We prove that, for r ≥ 2 and n ≥ n(r), every directed graph with n vertices and more edges than the r-partite Turán graph T (r, n) contains a subdivision of the transitive tournament on r + 1 vertices. Furthermore, the extremal graphs are the orientations of T (r, n) induced by orderings of the vertex classes.

متن کامل

Cyclic 2-structures and Spaces of Orderings of Power Series Fields in Two Variables

We consider the space of orderings of the field R((x, y)) and the space of orderings of the field R((x))(y), where R is a real closed field. We examine the structure of these objects and their relationship to each other. We define a cyclic 2-structure to be a pair (S, Φ) where S is a cyclically ordered set and Φ is an equivalence relation on S such that each equivalence class has exactly two el...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2009